Robust Localization from Incomplete Local Information

We consider the problem of localizing wireless devices in an ad-hoc network embedded in a d-dimensional Euclidean space. Obtaining a good estimation of where wireless devices are located is crucial in wireless network applications including environment monitoring, geographic routing and topology control. When the positions of the devices are unknown and only local distance information is given, we need to infer the positions from these local distance measurements. This problem is particularly challenging when we only have access to measurements that have limited accuracy and are incomplete. We consider the extreme case of this limitation on the available information, namely only the connectivity information is available, i.e., we only know whether a pair of nodes is within a fixed detection range of each other or not, and no information is known about how far apart they are. Further, to account for detection failures, we assume that even if a pair of devices is within the detection range, it fails to detect the presence of one another with some probability and this probability of failure depends on how far apart those devices are. Given this limited information, we investigate the performance of a centralized positioning algorithm MDS-MAP introduced by Shang et al., and a distributed positioning algorithm, introduced by Savarese et al., called HOP-TERRAIN. In particular, for a network consisting of n devices positioned randomly, we provide a bound on the resulting error for both algorithms. We show that the error is bounded, decreasing at a rate that is proportional to R/Rc, where Rc is the critical detection range when the resulting random network starts to be connected, and R is the detection range of each device.Comment: 40 pages, 13 figure

Robust localization methods for passivity enforcement of linear macromodels

In this paper we solve a non-smooth convex formulation for passivity enforcement of linear macromodels using robust localization based algorithms such as the ellipsoid and the cutting plane methods. Differently from existing perturbation based techniques, we solve the formulation based on the direct ℌ∞ norm minimization through perturbation of state-space model parameters. We provide a systematic way of defining an initial set which is guaranteed to contain the global optimum. We also provide a lower bound on the global minimum, that grows tighter at each iteration and hence guarantees δ - optimality of the computed solution. We demonstrate the robustness of our implementation by generating accurate passive models for challenging examples for which existing algorithms either failed or exhibited extremely slow convergenc

A Robust Localization System for Inspection Robots in Sewer Networks †

Sewers represent a very important infrastructure of cities whose state should be monitored periodically. However, the length of such infrastructure prevents sensor networks from being applicable. In this paper, we present a mobile platform (SIAR) designed to inspect the sewer network. It is capable of sensing gas concentrations and detecting failures in the network such as cracks and holes in the floor and walls or zones were the water is not flowing. These alarms should be precisely geo-localized to allow the operators performing the required correcting measures. To this end, this paper presents a robust localization system for global pose estimation on sewers. It makes use of prior information of the sewer network, including its topology, the different cross sections traversed and the position of some elements such as manholes. The system is based on a Monte Carlo Localization system that fuses wheel and RGB-D odometry for the prediction stage. The update step takes into account the sewer network topology for discarding wrong hypotheses. Additionally, the localization is further refined with novel updating steps proposed in this paper which are activated whenever a discrete element in the sewer network is detected or the relative orientation of the robot over the sewer gallery could be estimated. Each part of the system has been validated with real data obtained from the sewers of Barcelona. The whole system is able to obtain median localization errors in the order of one meter in all cases. Finally, the paper also includes comparisons with state-of-the-art Simultaneous Localization and Mapping (SLAM) systems that demonstrate the convenience of the approach.Unión Europea ECHORD ++ 601116Ministerio de Ciencia, Innovación y Universidades de España RTI2018-100847-B-C2

Localization in smart dust sensor networks

Our research goal is to design a robust localization system that offers good accuracy even in the harsh indoor and outdoor environments by handling problems in the physical layer. In this respect, localization based on ultra-wide band (UWB) technology with time-based ranging is a good candidate because of the fine delay resolution that is provided by UWB signals

Combining wireless and visual tracking for an indoor environment

There has been a lot of research done towards both camera and Wi-Fi tracking respectively, both these techniques have their benefits and drawbacks. By combining these technologies it is possible to eliminate their respective weaknesses, to increase the possibilities of the system as a whole. This is accomplished by fusing the sensor data from Wi-Fi and camera before inserting it in a particle filter. This will result in a more accurate and robust localization system

Robust Localization Using Context-Aware Filtering

In this paper we develop a robot localization technique that incorporates discrete context measurements, in addition to standard continuous state measurements. Context measurements provide binary information about detected events in the robot’s environment, e.g., a building is recognized using image processing or a known radio station is received. Such measurements can only be detected from certain positions and can, therefore, be correlated with the robot’s state. We investigate two specific examples where context measurements are especially useful – an urban localization scenario where GPS measurements are not reliable as well as the capture of the RQ-170 Sentinel drone in Iran, where GPS measurements were spoofed. By focusing on a specific class of probability of context detection functions, we derive a closed-form Gaussian mixture filter that is precise, captures context, and has the theoretical properties of the Kalman filter. Finally, we provide simulations of the urban localization scenario with an unmanned ground vehicle and show that the proposed context-aware filter is more robust and more accurate than the conventional extended Kalman filter, which only uses continuous measurements

Robust Localization of the Best Error with Finite Elements in the Reaction-Diffusion Norm

We consider the approximation in the reaction-diffusion norm with continuous finite elements and prove that the best error is equivalent to a sum of the local best errors on pairs of elements. The equivalence constants do not depend on the ratio of diffusion to reaction. As application, we derive local error functionals that ensure robust performance of adaptive tree approximation in the reaction-diffusion norm.Comment: 21 pages, 1 figur